Ordering Monte Carlo Markov Chains
نویسنده
چکیده
Markov chains having the same stationary distribution can be partially ordered by performance in the central limit theorem. We say that one chain is at least as good as another in the e ciency partial ordering if the variance in the central limit theorem is at least as small for every L( ) functional of the chain. Peskun partial ordering implies e ciency partial ordering [25, 30]. Here we show that Peskun partial ordering implies, for nite state spaces, ordering of all the eigenvalues of the transition matrices, and, for general state spaces, ordering of the suprema of the spectra of the transition operators. We also de ne a covariance partial ordering based on lag one autocovariances and show that it is equivalent to the e ciency partial ordering when restricted to reversible Markov chains. Similar but weaker results are provided for non-reversible Markov chains.
منابع مشابه
An Extension of Peskun and Tierney Orderings to Continuous Time Markov Chains
Peskun ordering is a partial ordering defined on the space of transition matrices of discrete time Markov chains. If the Markov chains are reversible with respect to a common stationary distribution π, Peskun ordering implies an ordering on the asymptotic variances of the resulting Markov chain Monte Carlo estimators of integrals with respect to π. Peskun ordering is also relevant in the framew...
متن کاملOrdering and Improving the Performance of Monte Carlo Markov Chains
An overview of orderings defined on the space of Markov chains having a prespecified unique stationary distribution is given. The intuition gained by studying these orderings is used to improve existing Markov chain Monte Carlo algorithms.
متن کاملCovariance Ordering for Discrete and Continuous Time Markov Chains
The covariance ordering, for discrete and continuous time Markov chains, is defined and studied. This partial ordering gives a necessary and sufficient condition for MCMC estimators to have small asymptotic variance. Connections between this ordering, eigenvalues, and suprema of the spectrum of the Markov transition kernel, are provided. A representation of the asymptotic variance of MCMC estim...
متن کاملMarkov Chain Monte Carlo
Markov chain Monte Carlo is an umbrella term for algorithms that use Markov chains to sample from a given probability distribution. This paper is a brief examination of Markov chain Monte Carlo and its usage. We begin by discussing Markov chains and the ergodicity, convergence, and reversibility thereof before proceeding to a short overview of Markov chain Monte Carlo and the use of mixing time...
متن کاملMonte Carlo Methods and Bayesian Computation: MCMC
Markov chain Monte Carlo (MCMC) methods use computer simulation of Markov chains in the parameter space. The Markov chains are defined in such a way that the posterior distribution in the given statistical inference problem is the asymptotic distribution. This allows to use ergodic averages to approximate the desired posterior expectations. Several standard approaches to define such Markov chai...
متن کامل